Creating a Uniform Framework for Task and Motion Planning: A Case for Incremental Heuristic Search? [Overview Paper]
نویسنده
چکیده
In this short overview paper, we describe our vision for combining task and motion planning and present a historical perspective to show which parts of it have already become reality. Robots do not have to plan only once but repeatedly. Replanning from scratch is often very time consuming. Incremental heuristic search addresses this issue by reusing information from previous searches to find solutions to series of similar search tasks often much faster than is possible by solving each search task from scratch. Incremental heuristic search has mostly been used for path planning in the past but we argue that it applies to many layers of robot architectures, in particular task and motion planning, which might allow one to design very homogeneous robot architectures with clean interfaces between the layers.
منابع مشابه
A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملTruncated Incremental Search: Faster Replanning by Exploiting Suboptimality
Incremental heuristic searches try to reuse their previous search efforts whenever these are available. As a result, they can often solve a sequence of similar planning problems much faster than planning from scratch. State-of-the-art incremental heuristic searches such as LPA*, D* and D* Lite all work by propagating cost changes to all the states on the search tree whose gvalues (the costs of ...
متن کاملPlanning in a cross dock network with an operational scheduling overview
Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capac...
متن کاملIncremental Heuristic Search in Games: The Quest for Speed
Robot path-planning methods can be used in real-time computer games but then need to run fast to ensure that the game characters move in real time, an issue addressed by incremental heuristic search methods. In this paper, we demonstrate how one can speed up D* Lite, an incremental heuristic search method that implements planning with the freespace assumption to move game characters in initiall...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010